Tensor Rank is Hard to Approximate

We prove that approximating the rank of a 3-tensor to within a factor of 1 + 1/1852 - delta, for any delta > 0, is NP-hard over any field. We do this via reduction from bounded occurrence 2-SAT

Trade-Offs Between Size and Degree in Polynomial Calculus

Building on [Clegg et al. \u2796], [Impagliazzo et al. \u2799] established that if an unsatisfiable k-CNF formula over n variables has a refutation of size S in the polynomial calculus resolution proof system, then this formula also has a refutation of degree k + O(?(n log S)). The proof of this works by converting a small-size refutation into a small-degree one, but at the expense of increasing the proof size exponentially. This raises the question of whether it is possible to achieve both small size and small degree in the same refutation, or whether the exponential blow-up is inherent. Using and extending ideas from [Thapen \u2716], who studied the analogous question for the resolution proof system, we prove that a strong size-degree trade-off is necessary